Section: New Software and Platforms

New Software

https://gforge.inria.fr/projects/cfs-signature/

Reference implementation of parallel CFS (reinforced version of the digital signature scheme CFS [93] due to Matthieu Finiasz [95] ). Two variants are proposed, one with a « bit-packing » finite field arithmetic and an evolution with a « bit-slicing » finite-field arithmetic (collaboration with Peter Schwabe). For 80 bits of security the running time for producing one signature with the « bit-packing » variant is slightly above one second. This is high but was still the fastest so far. The evolution with the « bit-slicing » arithmetic produces the same signature in about 100 milliseconds.

https://gforge.inria.fr/projects/collision-dec/

Implementation of two variants of information set decoding, Stern-Dumer [97] , [94] and MMT [96] . To our knowledge it is the best full-fledged open-source implementation of generic decoding of binary linear codes. It is the best generic attack against code-based cryptography. This software has the best score for breaking existing publicly available challenges (see http://pqcrypto.org/wild-challenges.html ).